Distance matrix of a graph and its realizability
نویسندگان
چکیده
منابع مشابه
On a relationship between graph realizability and distance matrix completion
We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an algorithmic relationship between the DISTANCE GEOMETRY PROBLEM and the EUCLIDEAN DISTANCE MATRIX COMPLETION PROBLEM.
متن کاملRealizing the distance matrix of a graph
An explicit description is giv e n for th e uniqu e gra ph with as few arcs (eac h bearin g a positive length) as pos s ibl e, whi c h has a presc rib ed mat rix of s hortest-p ath di stan ces be twee n pa irs of distinct vertices. The sam e is d one in th e case wh e n the ith diago na l matrix e ntr y, in s te ad o f be ing zero , represents th e. le ngth of a s hort est c losed path co ntain...
متن کاملtransference of imagery: a comparative formalistic study of shakespeares hamlet and its two persian translations
هدف از این تحقیق بررسی انتقال صور خیال هملت در دو ترجمه ی فارسی آن از نظر فرمالیستی بود. برای بدست آوردن داده-های مورد نیاز، 130 نمونه استعاره، مجاز، ایهام، کنایه و پارادوکس در متن اصلی مشخص شده و سپس بر اساس مدل نیومارک (1998) برای ترجمه ی استعاره یا بطور کلی زبان مجاز با معادل های فارسی شان مقایسه گردیدند. این تحقیق بر آن بود تا روش های استفاده شده برای ترجمه هر کدام از انواع زبان مجاز ذکر شد...
15 صفحه اولProduct Distance Matrix of a Graph and Squared Distance Matrix of a Tree
Let G be a strongly connected, weighted directed graph. We define a product distance η(i, j) for pairs i, j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix. The edge orientation matrix of a directed tree is defined and a formula for its determinant and its inverse, when it exists, is obtained....
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quarterly of Applied Mathematics
سال: 1965
ISSN: 0033-569X,1552-4485
DOI: 10.1090/qam/184873